Performance-driven Service Selection Using GSPN

نویسندگان

  • Jinchun Xia
  • Carl K. Chang
چکیده

Performance has been one of the major concerns in Web Services research area. Because of the underneath heterogeneous networks and platforms, service providers do not guarantee the quality level of service negotiated in the contract. Besides, the performance of service composition needs to be assured to adapt dynamic service composition. We proposed a Probebased Web Service composition environment, WS-Pro, to address these problems. Generalized Stochastic Petri nets (GSPN) is used to formally model the service net, and integrated into the WS-Pro, to cooperate with a Probe, which checks performance status of component services at runtime, to help with service selection, which is the core of service composition. This paper reports the modeling of service selection problem using the GSPN, and the replanning of service composition inside the architecture of WS-Pro.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis of Computing Servers using Stochastic Petri Nets and Markov Automata

Generalised Stochastic Petri Nets (GSPNs) are a widely used modeling formalism in the field of performance and dependability analysis. Their semantics and analysis is restricted to “well-defined”, i.e., confusion-free, nets. Recently, a new GSPN semantics has been defined that covers confused nets and for confusion-free nets is equivalent to the existing GSPN semantics. The key is the usage of ...

متن کامل

Determing Performance of Choreography-based Composite Services

Web Service Choreography Description Language is a main-stream standard for the description of peer-to-peer collaborations for the participants for service composition. To predict the performance of composite service processes gives the way to tell whether the process meet the non-functional requirements, and to choose the process with better performance from those with identical function. Unfo...

متن کامل

ON REPRESENTING MULTICLASS M/M/k QUEUES BY GENERALIZED STOCHASTIC PETRI NETS

In this paper we study the relations between multiclass BCMP-like service stations and generalized stochastic Petri nets (GSPN). Representing queuing discipline with GSPN models is not easy. We focus on representing multi-class queuing systems with different queuing disciplines by defining appropriate finite GSPN models. Note that queuing discipline in general affects performance measures in mu...

متن کامل

From Bcmp Queueing Networks to Generalized Stochastic Petri Nets: an Algorithm and an Equivalence Definition

In this paper we define an algorithm that converts a BCMP queueing network (QN) with multiple classes of customers into a generalized stochastic Petri net (GSPN). Product-form property of BCMP networks is preserved by the GSPN model. The algorithm can be embedded in a hybrid formalisms modelling tool. In fact a product-form model can be partially expressed in terms of queueing network and parti...

متن کامل

GSPN analysis of ABR in ATM LANs

This paper describes a GSPN model of an ATM LAN exploiting the EFCI ABR service category, and illustrates some numerical results. The GSPN model is constructed adopting a recently proposed approach for the use of GSPNs in the development of performance models of ATM network components. The numerical results quantify the dependence of the performance of the ATM LAN on several system parameters, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006